Highly edge‐connected regular graphs without large factorizable subgraphs
نویسندگان
چکیده
We construct highly edge-connected $r$-regular graph which do not contain $r-2$ pairwise disjoint perfect matchings. The results partially answer a question stated by Thomassen [Factorizing regular graphs, J. Comb. Theory Ser. B (2019), https://doi.org/10.1016/j.jctb.2019.05.002 (article in press)].
منابع مشابه
Three-regular Subgraphs of Four-regular Graphs'
The Berge–Sauer conjecture (see [2, 3]) says that any simple (no multiple edges and loops) 4-regular graph contains a 3-regular subgraph. This conjecture was proved in [4, 6]. In [1, 2] the Chevalley–Warning theorem was used to extend this result to graphs with multiple edges, which are 4-regular plus an edge. Our main result, Theorem 2.2, presents the sufficient condition for a 4-regular graph...
متن کاملRegular subgraphs of almost regular graphs
Suppose every vertex of a graph G has degree k or k + 1 and at least one vertex has degree k + 1. It is shown that if k > 2q 2 and q is a prime power then G contains a q-regular subgraph (and hence an r-regular subgraph for all r < q. r = q (mod 2)). It is also proved that every simple graph with maximal degree A > 2q 2 and average degree d > ((2q 2)/(2q l))(A + 1), where q is a prime power, co...
متن کاملRegular subgraphs of random graphs
In this paper, we prove that there exists a function ρk = (4 + o(1))k such that G(n, ρ/n) contains a k-regular graph with high probability whenever ρ > ρk. In the case of k = 3, it is also shown that G(n, ρ/n) contains a 3-regular graph with high probability whenever ρ > λ ≈ 5.1494. These are the first constant bounds on the average degree in G(n, p) for the existence of a k-regular subgraph. W...
متن کاملMaximum hypergraphs without regular subgraphs
We show that an n-vertex hypergraph with no r-regular subgraph has at most 2n−1 + r− 2 edges. We conjecture that if n > r, then every n-vertex hypergraph with no r-regular subgraph having the maximum number of edges contains a full star, that is, 2n−1 distinct edges containing a given vertex. We prove this conjecture for n ≥ 425. The condition that n > r cannot be weakened.
متن کاملLarge Nearly Regular Induced Subgraphs
For a real c ≥ 1 and an integer n, let f(n, c) denote the maximum integer f so that every graph on n vertices contains an induced subgraph on at least f vertices in which the maximum degree is at most c times the minimum degree. Thus, in particular, every graph on n vertices contains a regular induced subgraph on at least f(n, 1) vertices. The problem of estimating f(n, 1) was posed long time a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22729